翻訳と辞書 Words near each other ・ Redtoothed triggerfish ・ Redtop (Belmont, Massachusetts) ・ Redtop Peak ・ Redtown, Ohio ・ Redtribe ・ RedTube ・ Redtye ・ Redu ・ Redu Station ・ Reduan Abdullah ・ Reducción de Santa María la Mayor, Argentina ・ Reduce (computer algebra system) ・ Reduce America's Debt Now Act of 2011 ・ Reduce Impaired Driving Everywhere ・ Reduced affect display ・ Reduced cost ・ Reduced cream ・ Reduced derivative ・ Reduced dimensions form ・ Reduced dynamics ・ Reduced enamel epithelium ・ Reduced eye ・ Reduced fare program ・ Reduced form ・ Reduced frequency ・ Reduced gas ・ Reduced gradient bubble model ・ Reduced gravity aircraft ・ Reduced homology ・ Reduced instruction set computing Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Reduced cost ： ウィキペディア英語版 Reduced cost In linear programming, reduced cost, or opportunity cost, is the amount by which an objective function coefficient would have to improve (so increase for maximization problem, decrease for minimization problem) before it would be possible for a corresponding variable to assume a positive value in the optimal solution. It is the cost for increasing a variable by a small amount, i.e., the first derivative from a certain point on the polyhedron that constrains the problem. When the point is a vertex in the polyhedron, the variable with the most extreme cost, negatively for minimization and positively maximization, is sometimes referred to as the steepest edge. Given a system minimize $\backslash mathbf^T\backslash mathbf$ subject to $\backslash mathbf\backslash leq\backslash mathbf,\; \backslash mathbf\backslash geq\; 0$, the reduced cost vector can be computed as $\backslash mathbf\; -\; \backslash mathbf^T\; \backslash mathbf$, where $\backslash mathbf$ is the dual cost vector. It follows directly that for a minimization problem, any non-basic variables at their lower bounds with strictly negative reduced costs are eligible to enter that basis, while any basic variables must have a reduced cost that is exactly 0. For a maximization problem, the non-basic variables at their lower bounds that are eligible for entering the basis have a strictly positive reduced cost. == Interpretation == For the case where x and y are optimal, the reduced costs can help explain why variables attain the value they do. For each variable, the corresponding sum of that stuff gives the reduced cost show which constraints forces the variable up and down. For non-basic variables, the distance to zero gives the minimal change in the object coefficient to change the solution vector x. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Reduced cost」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.